class Solution {
    public int findTheWinner(int n, int k) {
        // Time complexity: O(n)
        // Space complexity: O(n)
        /*if(n == 1) {
            return 1;
        }

        return (findTheWinner(n - 1, k) + (k-1)) % n + 1;*/

        // Time complexity: O(n)
        // Space complexity: O(1)
        int players = 1, pos = 1;

        while(players <= n) {
            pos = (pos + (k - 1)) % players + 1;
            players++;
        }

        return pos;
        
    }
}